Generating Benders cuts for a general class of integer programming problemsYINGYI CHU; QUANSHI XIA.Lecture notes in computer science. 2004, pp 127-141, issn 0302-9743, isbn 3-540-21836-X, 15 p.Conference Paper

New tractable classes from oldCOHEN, David; JEAVONS, Peter; GAULT, Richard et al.Lecture notes in computer science. 2000, pp 160-171, issn 0302-9743, isbn 3-540-41053-8Conference Paper

Refinements and independence : A simple method for identifying tractable disjunctive constraintsBROXVALL, Mathias; JONSSON, Peter; RENZ, Jochen et al.Lecture notes in computer science. 2000, pp 114-127, issn 0302-9743, isbn 3-540-41053-8Conference Paper

A new abstract logic programming language and its quantifier elimination method for disjunctive logic programmingSTEPHAN, I.Lecture notes in computer science. 1998, pp 403-416, issn 0302-9743, isbn 3-540-64993-XConference Paper

Representation of logic formulas by normal formsDANKOVA, Martina.Kybernetika. 2002, Vol 38, Num 6, pp 717-728, issn 0023-5954, 12 p.Article

Normal forms for fuzzy logic functions and their approximation abilityPERFILIEVA, Irina.Fuzzy sets and systems. 2001, Vol 124, Num 3, pp 371-384, issn 0165-0114Article

Applying preference biases to conjunctive and disjunctive version spacesSMIRNOV, E. N; VAN DEN HERIK, H. J.Lecture notes in computer science. 2000, pp 321-330, issn 0302-9743, isbn 3-540-41044-9Conference Paper

Some estimates of the complexity of disjunctive normal forms of a random boolean functionTOMAN, E; TOMANOVA, J.Computers and artificial intelligence. 1991, Vol 10, Num 4, pp 327-340, issn 0232-0274Article

On the complexity of dualization of monotone disjunctive normal formsFREDMAN, M. L; KHACHIYAN, L.Journal of algorithms (Print). 1996, Vol 21, Num 3, pp 618-628, issn 0196-6774Article

Teaching classes with high teaching dimension using few examplesBALBACH, Frank J.Lecture notes in computer science. 2005, pp 668-683, issn 0302-9743, isbn 3-540-26556-2, 16 p.Conference Paper

Pseudo-Boolean optimization with a disjunctive constraintDONSKOI, V. I.Computational mathematics and mathematical physics. 1994, Vol 34, Num 3, pp 389-398, issn 0965-5425Article

A reactive local search-based algorithm for the disjunctively constrained knapsack problemHIFI, M; MICHRAFY, M.The Journal of the Operational Research Society. 2006, Vol 57, Num 6, pp 718-726, issn 0160-5682, 9 p.Article

Learning DNFs and circuits using teaching assistantsVARIYAM VINODCHANDRAN, N.Lecture notes in computer science. 2004, pp 188-197, issn 0302-9743, isbn 3-540-22856-X, 10 p.Conference Paper

Extracting minimal and closed monotone DNF formulasSHIMA, Yoshikazu; MITSUISHI, Shinji; HIRATA, Kouichi et al.Lecture notes in computer science. 2004, pp 298-305, issn 0302-9743, isbn 3-540-23357-1, 8 p.Conference Paper

Extraction of coverings as monotone DNF formulasHIRATA, Kouichi; NAGAZUMI, Ryosuke; HARAO, Masateru et al.Lecture notes in computer science. 2003, pp 166-179, issn 0302-9743, isbn 3-540-20293-5, 14 p.Conference Paper

What is the expressive power of disjunctive preconditions?NEBEL, B.Lecture notes in computer science. 2000, pp 294-307, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Conditional modeling. 2. Solving using complementarity and boundary-crossing formulationsRICO-RAMIREZ, V; WESTERBERG, A. W.Industrial & engineering chemistry research. 1999, Vol 38, Num 2, pp 531-553, issn 0888-5885Article

Double Horn functionsEITER, T; IBARAKI, T; MAKINO, K et al.Information and computation (Print). 1998, Vol 144, Num 2, pp 155-190, issn 0890-5401Article

Disjonctions temporelles dans les planificateurs à liens causaux = Temporal disjunctions in causal link plannersWOZNIAK, M; TAILLIBERT, P; VANHEEGHE, P et al.11th Conference on Shape recognition and artificial intelligenceReconnaissance des formes et intelligence artificielle. Congrès. 1997, pp 245-253, 3VolConference Paper

Solution of algebraic systems of disjunctive equationsGROSSMANN, I. E; TÜRKAY, M.Computers & chemical engineering. 1996, Vol 20, pp S339-S344, issn 0098-1354, SUPAConference Paper

A three-valued semantics for deductive databases and logic programsJIA-HUAI YOU; LI YAN YUAN.Journal of computer and system sciences (Print). 1994, Vol 49, Num 2, pp 334-361, issn 0022-0000Article

An alternative explanation of disjunctive formulationsWILLIAMS, H. P.European journal of operational research. 1994, Vol 72, Num 1, pp 200-203, issn 0377-2217Article

Duality in knowledge compilation techniquesMURRAY, Neil V; ROSENTHAL, Erik.Lecture notes in computer science. 2005, pp 182-190, issn 0302-9743, isbn 3-540-25878-7, 9 p.Conference Paper

A switching lemma for small restrictions and lower bounds for κ-DNF resolution: (Extended abstract)SEGERLIND, Nathan; BUSS, Sam; IMPAGLIAZZO, Russell et al.Annual Symposium on Foundations of Computer Science. 2002, pp 604-613, isbn 0-7695-1822-2, 10 p.Conference Paper

A top-down procedure for disjunctive well-founded semanticsWANG, Kewen.Lecture notes in computer science. 2001, pp 305-317, issn 0302-9743, isbn 3-540-42254-4Conference Paper